A Generating Function for Triangular Partitions
نویسندگان
چکیده
منابع مشابه
Generating Function for K-Restricted Jagged Partitions
We present a natural extension of Andrews’ multiple sums counting partitions of the form (λ1, · · · , λm) with λi ≥ λi+k−1 + 2. The multiple sum that we construct is the generating function for the so-called K-restricted jagged partitions. A jagged partition is a sequence of non-negative integers (n1, n2, · · · , nm) with nm ≥ 1 subject to the weakly decreasing conditions ni ≥ ni+1− 1 and ni ≥ ...
متن کاملA Mthod for Generating the Turbulent Intermittency Function
A detection method based on sensitization of a squared double differentiated signal is developed which discriminates the turbulent zones from laminar zones quite accurately. The procedure adopts a variable threshold and a variable hold time of the order of the Kolmogorov time scale. The output file so generated, includes all the information for further analysis of the turbulent signal.
متن کاملCombinatorial proofs of generating function identities for F-partitions
In his memoir in 1984, George E. Andrews introduces many general classes of Frobenius partitions (simply F-partitions). Especially, he focuses his interest on two general classes of F-partitions: one is F-partitions that allow up to k repetitions of an integer in any row, and the other is F-partitions whose parts are taken from k copies of the nonnegative integers. The latter are called k color...
متن کاملPartitions into three triangular numbers
A celebrated result of Gauss states that every positive integer can be represented as the sum of three triangular numbers. In this article we study p3∆(n), the number of partitions of the integer n into three triangular numbers, as well as p3∆(n), the number of partitions of n into three distinct triangular numbers. Unlike t(n), which counts the number of representations of n into three triangu...
متن کاملGenerating Primes Using Partitions
This paper presents a new technique of generating large prime numbers using a smaller one by employing Goldbach partitions. Experiments are presented showing how this method produces candidate prime numbers that are subsequently tested using either Miller Rabin or AKS primality tests. Introduction Generation of large prime numbers is fundamental to modern cryptography protocols [1],[2], generat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1975
ISSN: 0025-5718
DOI: 10.2307/2005462